TSTP Solution File: ITP136^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP136^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:07:05 EDT 2024
% Result : Theorem 0.47s 0.67s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 22 ( 8 unt; 10 typ; 0 def)
% Number of atoms : 34 ( 16 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 99 ( 17 ~; 13 |; 5 &; 62 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 4 ( 0 ^ 4 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
paraco1605129243lle_tv: $tType ).
thf(decl_sort3,type,
list_char: $tType ).
thf(decl_sort4,type,
paraco1604210848lle_fm: $tType ).
thf(decl_51,type,
paraco761681009ge_int: ( nat > nat ) > ( list_char > paraco1605129243lle_tv ) > list_char > paraco1605129243lle_tv ).
thf(decl_54,type,
paraco1325918602e_eval: ( list_char > paraco1605129243lle_tv ) > paraco1604210848lle_fm > paraco1605129243lle_tv ).
thf(decl_61,type,
paraco1344940915le_Det: $o > paraco1605129243lle_tv ).
thf(decl_179,type,
f: nat > nat ).
thf(decl_180,type,
i: list_char > paraco1605129243lle_tv ).
thf(decl_182,type,
p2: paraco1604210848lle_fm ).
thf(fact_6_b,axiom,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ ~ $true ) ),
file('/export/starexec/sandbox2/tmp/tmp.tiAeeLzcIu/E---3.1_16783.p',fact_6_b) ).
thf(conj_0,conjecture,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
!= ( paraco1344940915le_Det @ $true ) ),
file('/export/starexec/sandbox2/tmp/tmp.tiAeeLzcIu/E---3.1_16783.p',conj_0) ).
thf(fact_8_tv_Oinject_I1_J,axiom,
! [X1: $o,X2: $o] :
( ( ( paraco1344940915le_Det @ X1 )
= ( paraco1344940915le_Det @ X2 ) )
<=> ( X1
<=> X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.tiAeeLzcIu/E---3.1_16783.p',fact_8_tv_Oinject_I1_J) ).
thf(c_0_3,axiom,
( ( ~ ~ $true
| ( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ $true ) ) )
& ( ~ $true
| ( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ $false ) ) ) ),
inference(fool_unroll,[status(thm)],[fact_6_b]) ).
thf(c_0_4,plain,
( ( $true
| ( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ $true ) ) )
& ( ~ $true
| ( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ $false ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
thf(c_0_5,plain,
( ( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ ~ $true ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ $true ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_7,plain,
! [X1138: $o,X1139: $o] :
( ( ~ X1138
| X1139
| ( ( paraco1344940915le_Det @ X1138 )
!= ( paraco1344940915le_Det @ X1139 ) ) )
& ( ~ X1139
| X1138
| ( ( paraco1344940915le_Det @ X1138 )
!= ( paraco1344940915le_Det @ X1139 ) ) )
& ( ~ X1138
| ~ X1139
| ( ( paraco1344940915le_Det @ X1138 )
= ( paraco1344940915le_Det @ X1139 ) ) )
& ( X1138
| X1139
| ( ( paraco1344940915le_Det @ X1138 )
= ( paraco1344940915le_Det @ X1139 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_8_tv_Oinject_I1_J])])])]) ).
thf(c_0_8,plain,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ ~ $true ) ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
( ( paraco1344940915le_Det @ $true )
!= ( paraco1344940915le_Det @ ~ $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7])])]) ).
thf(c_0_11,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.19 % Problem : ITP136^1 : TPTP v8.1.2. Released v7.5.0.
% 0.13/0.21 % Command : run_E %s %d THM
% 0.21/0.42 % Computer : n021.cluster.edu
% 0.21/0.42 % Model : x86_64 x86_64
% 0.21/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.42 % Memory : 8042.1875MB
% 0.21/0.42 % OS : Linux 3.10.0-693.el7.x86_64
% 0.21/0.42 % CPULimit : 300
% 0.21/0.42 % WCLimit : 300
% 0.21/0.42 % DateTime : Fri May 3 12:34:13 EDT 2024
% 0.21/0.42 % CPUTime :
% 0.44/0.61 Running higher-order theorem proving
% 0.44/0.61 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.tiAeeLzcIu/E---3.1_16783.p
% 0.47/0.67 # Version: 3.1.0-ho
% 0.47/0.67 # Preprocessing class: HSLMSMSMSSMNHSA.
% 0.47/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.67 # Starting new_ho_10 with 1500s (5) cores
% 0.47/0.67 # Starting full_lambda_7 with 300s (1) cores
% 0.47/0.67 # Starting new_ho_4 with 300s (1) cores
% 0.47/0.67 # Starting lpo5_fix with 300s (1) cores
% 0.47/0.67 # new_ho_4 with pid 16863 completed with status 0
% 0.47/0.67 # Result found by new_ho_4
% 0.47/0.67 # Preprocessing class: HSLMSMSMSSMNHSA.
% 0.47/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.67 # Starting new_ho_10 with 1500s (5) cores
% 0.47/0.67 # Starting full_lambda_7 with 300s (1) cores
% 0.47/0.67 # Starting new_ho_4 with 300s (1) cores
% 0.47/0.67 # SinE strategy is GSinE(CountFormulas,hypos,5.5,,2,20000,1.0,true)
% 0.47/0.67 # Search class: HGHSM-FSLM31-MHSFFMBN
% 0.47/0.67 # partial match(1): HGHSM-FSLM31-MHSFFSBN
% 0.47/0.67 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.47/0.67 # Starting almost_fo_1 with 163s (1) cores
% 0.47/0.67 # almost_fo_1 with pid 16865 completed with status 0
% 0.47/0.67 # Result found by almost_fo_1
% 0.47/0.67 # Preprocessing class: HSLMSMSMSSMNHSA.
% 0.47/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.67 # Starting new_ho_10 with 1500s (5) cores
% 0.47/0.67 # Starting full_lambda_7 with 300s (1) cores
% 0.47/0.67 # Starting new_ho_4 with 300s (1) cores
% 0.47/0.67 # SinE strategy is GSinE(CountFormulas,hypos,5.5,,2,20000,1.0,true)
% 0.47/0.67 # Search class: HGHSM-FSLM31-MHSFFMBN
% 0.47/0.67 # partial match(1): HGHSM-FSLM31-MHSFFSBN
% 0.47/0.67 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.47/0.67 # Starting almost_fo_1 with 163s (1) cores
% 0.47/0.67 # Preprocessing time : 0.007 s
% 0.47/0.67 # Presaturation interreduction done
% 0.47/0.67
% 0.47/0.67 # Proof found!
% 0.47/0.67 # SZS status Theorem
% 0.47/0.67 # SZS output start CNFRefutation
% See solution above
% 0.47/0.67 # Parsed axioms : 555
% 0.47/0.67 # Removed by relevancy pruning/SinE : 434
% 0.47/0.67 # Initial clauses : 337
% 0.47/0.67 # Removed in clause preprocessing : 47
% 0.47/0.67 # Initial clauses in saturation : 290
% 0.47/0.67 # Processed clauses : 16
% 0.47/0.67 # ...of these trivial : 0
% 0.47/0.67 # ...subsumed : 3
% 0.47/0.67 # ...remaining for further processing : 12
% 0.47/0.67 # Other redundant clauses eliminated : 0
% 0.47/0.67 # Clauses deleted for lack of memory : 0
% 0.47/0.67 # Backward-subsumed : 0
% 0.47/0.67 # Backward-rewritten : 1
% 0.47/0.67 # Generated clauses : 0
% 0.47/0.67 # ...of the previous two non-redundant : 1
% 0.47/0.67 # ...aggressively subsumed : 0
% 0.47/0.67 # Contextual simplify-reflections : 0
% 0.47/0.67 # Paramodulations : 0
% 0.47/0.67 # Factorizations : 0
% 0.47/0.67 # NegExts : 0
% 0.47/0.67 # Equation resolutions : 0
% 0.47/0.67 # Disequality decompositions : 0
% 0.47/0.67 # Total rewrite steps : 4
% 0.47/0.67 # ...of those cached : 2
% 0.47/0.67 # Propositional unsat checks : 0
% 0.47/0.67 # Propositional check models : 0
% 0.47/0.67 # Propositional check unsatisfiable : 0
% 0.47/0.67 # Propositional clauses : 0
% 0.47/0.67 # Propositional clauses after purity: 0
% 0.47/0.67 # Propositional unsat core size : 0
% 0.47/0.67 # Propositional preprocessing time : 0.000
% 0.47/0.67 # Propositional encoding time : 0.000
% 0.47/0.67 # Propositional solver time : 0.000
% 0.47/0.67 # Success case prop preproc time : 0.000
% 0.47/0.67 # Success case prop encoding time : 0.000
% 0.47/0.67 # Success case prop solver time : 0.000
% 0.47/0.67 # Current number of processed clauses : 11
% 0.47/0.67 # Positive orientable unit clauses : 2
% 0.47/0.67 # Positive unorientable unit clauses: 0
% 0.47/0.67 # Negative unit clauses : 9
% 0.47/0.67 # Non-unit-clauses : 0
% 0.47/0.67 # Current number of unprocessed clauses: 275
% 0.47/0.67 # ...number of literals in the above : 1185
% 0.47/0.67 # Current number of archived formulas : 0
% 0.47/0.67 # Current number of archived clauses : 1
% 0.47/0.67 # Clause-clause subsumption calls (NU) : 0
% 0.47/0.67 # Rec. Clause-clause subsumption calls : 0
% 0.47/0.67 # Non-unit clause-clause subsumptions : 0
% 0.47/0.67 # Unit Clause-clause subsumption calls : 2
% 0.47/0.67 # Rewrite failures with RHS unbound : 0
% 0.47/0.67 # BW rewrite match attempts : 1
% 0.47/0.67 # BW rewrite match successes : 1
% 0.47/0.67 # Condensation attempts : 0
% 0.47/0.67 # Condensation successes : 0
% 0.47/0.67 # Termbank termtop insertions : 27708
% 0.47/0.67 # Search garbage collected termcells : 8888
% 0.47/0.67
% 0.47/0.67 # -------------------------------------------------
% 0.47/0.67 # User time : 0.026 s
% 0.47/0.67 # System time : 0.006 s
% 0.47/0.67 # Total time : 0.032 s
% 0.47/0.67 # Maximum resident set size: 3972 pages
% 0.47/0.67
% 0.47/0.67 # -------------------------------------------------
% 0.47/0.67 # User time : 0.042 s
% 0.47/0.67 # System time : 0.011 s
% 0.47/0.67 # Total time : 0.052 s
% 0.47/0.67 # Maximum resident set size: 2876 pages
% 0.47/0.67 % E---3.1 exiting
% 0.47/0.67 % E exiting
%------------------------------------------------------------------------------